Proving Parikh's theorem using Chomsky-Schutzenberger theorem
نویسنده
چکیده
Parikh theorem was originally stated and proved by Rohkit Parikh in MIT research report in 1961. Many different proofs of this classical theorems were produced then; our goal is to give another proof using Chomsky-Schutzenberger representation theorem. We present the proof which doesn't use any formal language theory tool at all except the representation theorem, just some linear algebra.
منابع مشابه
A short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملFormal Languages and Groups as Memory
We present an exposition of the theory of finite automata augmented with a multiply-only register storing an element of a given monoid or group. Included are a number of new results of a foundational nature. We illustrate our techniques with a group-theoretic interpretation and proof of a key theorem of Chomsky and Schutzenberger from formal language theory.
متن کاملParikh's Theorem Does Not Hold for Multiplicities
We consider the question of whether the famous Parikh's theorem holds with multiplicities i.e., for formal power series instead of languages. We introduce two families of semilinear formal power series over a commutative product monoid. The strict hierarchy of algebraic, rational, recognizable and semi-linear formal power series is proved and in this way it is established that the Parikh's theo...
متن کاملParikh's Theorem: A simple and direct construction
Parikh’s theorem states that every context-free language has the same Parikh image as some regular language. We present a very simple construction that, given a context-free grammar, produces a finite automaton recognizing such a regular language. The Parikh image of a word w over an alphabet {a1, . . . , an} is the vector v = (v1, . . . , vn) ∈ N such that vi is the number of occurrences of ai...
متن کاملParikh’s theorem
This chapter will discuss Parikh’s theorem and provide a proof for it. The proof is done by induction over a set of derivation trees, and using the Parikh mappings obtained from the set of terminal derivation trees and the possible enlargement of them during derivation. Moreover, the usefulness of the theorem will be lightly addressed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1710.09612 شماره
صفحات -
تاریخ انتشار 2017